Development of a Land Transportation Recommendation System Using the Hill Climbing Algorithm
نویسندگان
چکیده
منابع مشابه
When a genetic algorithm outperforms hill-climbing
A toy optimisation problem is introduced which consists of a ÿtness gradient broken up by a series of hurdles. The performance of a hill-climber and a stochastic hill-climber are computed. These are compared with the empirically observed performance of a genetic algorithm (GA) with and without. The hill-climber with a suuciently large neighbourhood outperforms the stochastic hill-climber, but i...
متن کاملPALO: A Probabilistic Hill-Climbing Algorithm
Many learning systems search through a space of possible performance elements, seeking an element whose expected utility, over the distribution of problems, is high. As the task of nding the globally optimal element is often intractable, many practical learning systems instead hill-climb to a local optimum. Unfortunately, even this is problematic as the learner typically does not know the under...
متن کاملTEM Color Image Segmentation using Hill Climbing Algorithm
TEM image is rapidly gaining prominence in various fields. Since high resolution TEM image captures huge amount of information, it is important to understand image segmentation techniques on it. The goal of image segmentation is to cluster pixels into salient image regions, i.e., regions corresponding to individual surfaces, objects, or natural parts of objects. To have region based image retri...
متن کاملthe effect of using visual aids on the development of speech act of disagreement among iranian intermediate efl learners
abstract the present study tried to investigate the effect of visual aids (films) on the development of the speech act of disagreement among iranian efl intermediate learners. to this end, the researcher selected 40 homogeneous intermediate learners based on their scores on oxford placement test. .the subjects then divided into control group and experimental group. both classes were tested by ...
Convergence of a Hill Climbing Genetic Algorithm for Graph Matching
This paper presents a convergence analysis for the problem of consistent labelling using genetic search. The work builds on a recent empirical study of graph matching where we showed that a Bayesian consistency measure could be e$ciently optimised using a hybrid genetic search procedure which incorporated a hill-climbing step. In the present study we return to the algorithm and provide some the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Engineering and Applied Science Research
سال: 2020
ISSN: 2745-6455
DOI: 10.26418/ijeasr.v1i1.41312